On Subliminal Channels in Deterministic Signature Schemes
نویسندگان
چکیده
Subliminal channels in randomized signature algorithms like the DSA are well-known. However, much less seems to be known about this issue when dealing with deterministic schemes. Using some known signature schemes like ESIGN-D and SFLASH as example, we illustrate the problem of subliminal channels in non-interactive deterministic signature algorithms. Based on an appropriate formalization, a deterministic variant of RSA-PSS is shown to be subliminal free.
منابع مشابه
Subliminal Channels in Discrete Logarithm Based Signature Schemes and How to Avoid Them Subliminal Channels in Discrete Logarithm Based Signature Schemes and How to Avoid Them
Limited distribution notes: This report has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher its distribution outside the University of Technology Chemnitz-Zwickau prior to publication should be limited to peer communications and speciic requests. After outside publication, requests should be lled only by rep...
متن کاملA digital signature with multiple subliminal channels and its applications
In this paper, we present two schemes for embedding multiple subliminal messages into one-time signature schemes (OTSSs) proposed by Lamport (1971, 1981) [35,36]. Our schemes have the advantage that the subliminal receivers cannot forge a valid signature since they do not share the signer’s secret key. Our schemes can also providemore than one independent subliminal message, and the numbers of ...
متن کاملExploring Signature Schemes with Subliminal Channel
The subliminal channel in a cryptographic protocol such as an authentication system or a signature scheme provides an additional channel from the sender to an authorized receiver and can’t be read by any unauthorized receiver. In this paper, we firstly show that Hess’s ID-Based signature scheme in SAC’02 can provide digital signature with the broadband and narrowband subliminal channels. Second...
متن کاملRsa Signature Schemes with Subliminal-free Public Key
The problem of subliminal channels in the signatures was already studied in the previous literature. In this paper we focus on the problem of subliminal communication through the public verification key. We show a construction which derives a subliminal-free RSA public key. Along the construction we use a computationally binding and unconditionally hiding commitment scheme. To establish a subli...
متن کاملExploring Subliminal Channels in Pairing-Based Signatures
The prisoners’ problem, introduced by Simmons in 1983, describes how two individuals attempt to communicate covertly by exploiting subliminal channels without alerting a ”warden” who controls the communication. Via subliminal channels it is possible to transmit covert messages by embedding them into cryptographic digital data (traditionally by exploiting randomness that is used in probabilistic...
متن کامل